SICSTUS Prolog - определение. Что такое SICSTUS Prolog
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое SICSTUS Prolog - определение

PROGRAMMING LANGUAGE THAT USES FIRST ORDER LOGIC
Prolog programming language; Prolog (programming language); ISO/IEC 13211-1; PROLOG; PROLOG programming language; Prolog II; ISO/IEC 13211-2; Prologue language; SICStus Prolog; SICStus; Criticism of Prolog; ISO/IEC 13211; Prolog language; ISO-Prolog; ISO Prolog; Design patterns in Prolog; Prolog-MPI; Meta-interpreters in Prolog
Найдено результатов: 19
SICStus Prolog         
A Prolog from the SICS (Swedish Inst of Comp Sci). E-mail: <sicstus-request@sics.se>. Mailing list: sicstus-users@sics.se. (1995-01-05)
PROLOG         
PROgramming in LOGic
Prolog         
·noun & ·v Prologue.
Prolog         
<programming> Programming in Logic or (French) Programmation en Logique. The first of the huge family of {logic programming} languages. Prolog was invented by Alain Colmerauer and Phillipe Roussel at the University of Aix-Marseille in 1971. It was first implemented 1972 in ALGOL-W. It was designed originally for natural-language processing but has become one of the most widely used languages for artificial intelligence. It is based on LUSH (or SLD) resolution {theorem proving} and unification. The first versions had no user-defined functions and no control structure other than the built-in depth-first search with backtracking. Early collaboration between Marseille and Robert Kowalski at University of Edinburgh continued until about 1975. Early implementations included C-Prolog, ESLPDPRO, Frolic, LM-Prolog, Open Prolog, SB-Prolog, {UPMAIL Tricia Prolog}. In 1998, the most common Prologs in use are Quintus Prolog, SICSTUS Prolog, LPA Prolog, {SWI Prolog}, AMZI Prolog, SNI Prolog. ISO draft standard at {prolog/standard/">Darmstadt, Germany (ftp://ftp.th-darmstadt.de/pub/programming/languages/prolog/standard/)}. or UGA, USA (ftp://ai.uga.edu/ai.prolog.standard). See also negation by failure, Kamin's interpreters, Paradigms of AI Programming, Aditi. A Prolog interpreter in Scheme. ftp://cpsc.ucalgary.ca/pub/prolog1.1. {A Prolog package (ftp://cpsc.ucalgary.ca/pub/prolog1.1/prolog11.tar.Z)} from the University of Calgary features delayed goals and interval arithmetic. It requires Scheme with continuations. ["Programming in Prolog", W.F. Clocksin & C.S. Mellish, Springer, 1985]. (2001-04-01)
Prolog         
['pr??l?g]
¦ noun Computing a high-level computer programming language first devised for artificial intelligence applications.
Origin
1970s: from the first elements of programming and logic.
Lambda Prolog         
LOGIC PROGRAMMING LANGUAGE FEATURING POLYMORPHIC TYPING, MODULAR PROGRAMMING
LProlog; Lambda Prolog; LambdaProlog; Lambda prolog
<language> An extension of standard Prolog defined by Dale A. Miller and Gopalan Nadathur in 1986, in which terms are strongly typed lambda terms. Clauses are higher order hereditary Harrop formulas. The main novelties are universal quantification on goals and implication. The Prolog/Mali compiler compiles Lambda Prolog for the MALI abstract memory system. Teyjus (http://teyjus.cs.umn.edu/) is an implementation of Lambda Prolog. Lambda Prolog home (http://cse.psu.edu/Lambda Prologdale/lProlog/). Mailing list: lprolog@cs.umn.edu. ["Higher-order logic programming", Miller D.A. and Nadathur G., 3rd International Conference on Logic Programming, pp 448-462, London 1986]. [Nadathur G. "A Higher-Order Logic as a Basis for Logic Programming", Thesis, University of Pennsylvania, 1987]. (2002-10-15)
Turbo Prolog         
PROGRAMMING LANGUAGE
Turbo Prolog
A strongly typed Prolog-like logic programming language. 1986. It has user-defined domains. Programs are arranged in sections: DOMAINS, CLAUSES, PREDICATES, DATABASE and GOAL. It is currently known as PDC Prolog and is distributed by Prolog Development Center, Atlanta +1 404 873 1366. E-mail: <pdc@mcimail.com>.
SWI-Prolog         
FREE IMPLEMENTATION OF THE PROGRAMMING LANGUAGE PROLOG, COMMONLY USED FOR TEACHING AND SEMANTIC WEB APPLICATIONS
SWI Prolog; Sociaal-Wetenschappelijke Informatica Prolog; Swipl; XPCE; SWIPL
<programming> A Prolog by Jan Wielemaker <jan@swi.psy.uva.nl> like a superset of Edinburgh Prolog. Version 1.7.2. Docking Station is distributed under {General Public License}. It runs on Sun-4, Sun-3, Linux, DEC MIPS (incomplete), RS/6000, PS2/AIX, Atari ST, Gould PN, NeXT, VAX, HP-UX (problems), MS-DOS, and OS/2. Prolog">ftp://swi.psy.uva.nl/pub/SWI-Prolog. OS/2 (ftp://mpii02999.ag2.mpi-sb.mpg.de/pub/toolw/SWI/). Mailing list: prolog-request@swi.psy.uva.nl. (2000-03-23)
Prolog syntax and semantics         
SET OF RULES DEFINING CORRECTLY STRUCTURED PROLOG PROGRAMS
Anonymous variables in Prolog; Data types in Prolog
The syntax and semantics of Prolog, a programming language, are the sets of rules that define how a Prolog program is written and how it is interpreted, respectively. The rules are laid out in ISO standard ISO/IEC 13211ISO/IEC 13211: Information technology — Programming languages — Prolog.
Prolog++         
OBJECT-ORIENTED TOOLKIT
(After C++) Prolog with object-oriented features added by Phil Vasey of Logic Programming Associates. Prolog++ is available for MS-DOS and the X Window System. It is distributed by AI International Ltd. in England and by Quintus.

Википедия

Prolog

Prolog is a logic programming language associated with artificial intelligence and computational linguistics.

Prolog has its roots in first-order logic, a formal logic, and unlike many other programming languages, Prolog is intended primarily as a declarative programming language: the program logic is expressed in terms of relations, represented as facts and rules. A computation is initiated by running a query over these relations.

The language was developed and implemented in Marseille, France, in 1972 by Alain Colmerauer with Philippe Roussel, based on Robert Kowalski's procedural interpretation of Horn clauses at University of Edinburgh.

Prolog was one of the first logic programming languages and remains the most popular such language today, with several free and commercial implementations available. The language has been used for theorem proving, expert systems, term rewriting, type systems, and automated planning, as well as its original intended field of use, natural language processing. Modern Prolog environments support the creation of graphical user interfaces, as well as administrative and networked applications.

Prolog is well-suited for specific tasks that benefit from rule-based logical queries such as searching databases, voice control systems, and filling templates.